Two polynomial algorithms for special maximum matching constructing in trees
نویسندگان
چکیده
For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.
منابع مشابه
Title Approximation and parameterized algorithms for commonsubtrees and edit distance between unordered trees
Given two rooted, labeled, unordered trees, the common subtree problem is to find a bijective matching between subsets of nodes of the trees of maximum cardinality which preserves labels and ancestry relationship. The tree edit distance problem is to determine the least cost sequence of insertions, deletions and substitutions that converts a tree into another given tree. Both problems are known...
متن کاملApproximation and parameterized algorithms for commonsubtrees and edit distance between unordered
Given two rooted, labeled, unordered trees, the common subtree problem is to find a bijective matching between subsets of nodes of the trees of maximum cardinality which preserves labels and ancestry relationship. The tree edit distance problem is to determine the least cost sequence of insertions, deletions and substitutions that converts a tree into another given tree. Both problems are known...
متن کاملLectures 4 and 5 – Matchings
A matching in a graph is a set of edges, no two of which share an endpoint. We describe Edmond’s algorithm for finding matchings of maximum cardinality in a graph. For bipartite graphs with edge weights, we also show how to find matchings of maximum weight. It is recommended that the reader draws pictures of the various constructs that we use (such as alternating trees). I was too lazy to incor...
متن کاملApproximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Given two rooted, labeled, unordered trees, the common subtree problem is to find a bijective matching between subsets of nodes of the trees of maximum cardinality which preserves labels and ancestry relationship. The tree edit distance problem is to determine the least cost sequence of insertions, deletions and substitutions that converts a tree into another given tree. Both problems are known...
متن کاملAn Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
A widely used method for determining the similarity of two labeled trees is to compute a maximum agreement subtree of the two trees. Previous work on this similarity measure is only concerned with the comparison of labeled trees of two special kinds, namely, uniformly labeled trees (i.e., trees with all their nodes labeled by the same symbol) and evolutionary trees (i.e., leaf-labeled trees wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0707.2295 شماره
صفحات -
تاریخ انتشار 2007